Polynomial-exponential equations and linear recurrences
نویسندگان
چکیده
منابع مشابه
Diophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملCombinatorial Recurrences and Linear Difference Equations
In this work we introduce the triangular arrays of depth greater than 1 given by linear recurrences, that generalize some well-known recurrences that appear in enumerative combinatorics. In particular, we focussed on triangular arrays of depth 2, since they are closely related to the solution of linear three–term recurrences. We show through some simple examples how these triangular arrays appe...
متن کاملExpressing Reachability in Linear Recurrences, as Infinite Determinants and Rational Polynomial Equations
We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is equal to the i term in a non-Homogenous Linear Recurrence. We use this to derive the infinite determinant that is zero, if and only if, the desired rational can be reached by some term in the recurrence. Second, we de...
متن کاملLinear, Polynomial or Exponential? Complexity Inference in Polynomial Time
We present a new method for inferring complexity properties for imperative programs with bounded loops. The properties handled are: polynomial (or linear) boundedness of computed values, as a function of the input; and similarly for the running time. It is well known that complexity properties are undecidable for a Turing-complete programming language. Much work in program analysis overcomes th...
متن کاملExponential and Polynomial Decay for First Order Linear Volterra Evolution Equations
We consider, in an abstract setting, an instance of the Coleman-Gurtin model for heat conduction with memory, that is, the Volterra integro-differential equation ∂tu(t)− β∆u(t)− ∫ t 0 k(s)∆u(t− s)ds = 0. We establish new results for the exponential and polynomial decay of solutions, by means of conditions on the convolution kernel which are weaker than the classical differential inequalities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasnik Matematicki
سال: 2003
ISSN: 0017-095X
DOI: 10.3336/gm.38.2.03